Scoring rule voting games and dominance solvability

نویسندگان

  • Lucia Buenrostro
  • Amrita Dhillon
  • Peter Vida
چکیده

This paper studies the dominance-solvability (by iterated deletion of weakly dominated strategies) of general scoring rule voting games. The scoring rules we study include Plurality rule, Approval voting, Negative Plurality Rule, Borda rule and Relative Utilitarianism. We provide a classification of scoring rule voting games according to whether the sufficient conditions for dominance solvability require sufficient agreement on the best alternative or on the worst alternative. We also characterise the solutions when the sufficient conditions for dominance solvability are satisfied.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

The Borda Count and Dominance Solvable Voting Games

We analyse dominance solvability (by iterated elimination of weakly dominated strategies) of voting games with three candidates and provide sufficient and necessary conditions for the Borda Count to yield a unique winner. We find that Borda is the unique scoring rule that is dominance solvable both (i) under unanimous agreement on a best candidate and (ii) under unanimous agreement on a worst c...

متن کامل

When are plurality rule voting games dominance-solvable?

This paper studies the dominance-solvability (by iterated deletion of weakly dominated strategies) of plurality rule voting games. For any number of alternatives and at least four voters, we find sufficient conditions for the game to be dominance-solvable (DS) and not to be DS. These conditions can be stated in terms of only one aspect of the game, the largest proportion of voters who agree on ...

متن کامل

Comparison of Scoring Rules in Poisson Voting Games

Scoring rules are compared by the equilibria that they generate for simple elections with three candidates and voters drawn from large Poisson distributions. A calculus for comparing pivot probabilities in Poisson voting games is applied. For a symmetric Condorcet cycle, nonsymmetric discriminatory equilibria exist under best-rewarding scoring rules like plurality voting. A candidate who is uni...

متن کامل

Iterated Regret Minimization in Voting Games

The game-theoretic solution concept Iterated Regret Minimization (IRM) was introduced recently by Halpern and Pass. We give the first application of IRM to simultaneous voting games. We study positional scoring rules in detail and give theoretical results demonstrating the bias of IRM toward sincere voting. We present comprehensive simulation results of the effect on social welfare of IRM compa...

متن کامل

On the informational efficiency of simple scoring rules

We study information aggregation in large elections. With two candidates, efficient information aggregation is possible in a large election (e.g., Feddersen and Pesendorfer [4, 5, 6], among others). We find that this result does not extend to large elections with more than two candidates. More precisely, we study a class of simple scoring rules in large voting games with Poisson population unce...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Social Choice and Welfare

دوره 40  شماره 

صفحات  -

تاریخ انتشار 2013